Hierarchical gate-array routing on a hypercube multiprocessor
نویسندگان
چکیده
منابع مشابه
Hierarchical Gate-Array Routing on a Hypercube Multiprocessor
Gate-arrays are the most common design style for semicus-tom VLSI integrated circuits. An important part of the gate-array design process is the routing of wires between the logic elements, which is an extremely compute-intensive operation. This paper presents an algorithm for routing gate-arrays that uses a hypercube connected parallel processor to provide the necessary computation power. In o...
متن کاملA Multi-mode Fault-tolerant Hypercube Multiprocessor
In this paper, we present a real-time fault-tolerant design for a d-dimensional hypercube multiprocessor with two modes of operations and examine its reconfigurability. The augmented hypercube, at stage one, has a spare node connected to each node of a subcube of dimension i, and the spare nodes are also connected as a (d i)-dimensional hypercube. At stage two, the process is repeated by assign...
متن کاملHyCube: A DHT Routing System Based on a Hierarchical Hypercube Geometry
This paper presents a DHT routing system based on a hierarchical hypercube geometry. An approach employing a novel variable metric adopting the Steinhaus transform is presented. The use of this metric and the hierarchical hypercube geometry allows to reach very good performance of the network and a very high level of resilience to node failures. The architecture of the network and the routing a...
متن کاملOrdered Fast Fourier Transforms on a Massively Parallel Hypercube Multiprocessor
We examine design alternatives for ordered FFT algorithms on massively parallel hypercube multiprocessors such as the Connection Machine. Particular emphasis is placed on reducing communication which is known to dominate the overall computing time. To this end we combine the order and computational phases of the FFT and also use sequence to processor maps that reduce communication. The class of...
متن کاملAll Pairs Shortest Paths on a Hypercube Multiprocessor
Two plausible ways to implement Floyd’s all pairs shortest paths algorithm on a hypercube mutiprocessor are considered. These are evaluated experimentally. A comparison with using Dijkstra’s single source all desitination algorithm on each processor is also done.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 1990
ISSN: 0743-7315
DOI: 10.1016/0743-7315(90)90130-h